Rotting Oranges

Try to solve the Rotting Oranges problem.

We'll cover the following

Statement
Examples
Understand the problem
Try it yourself

Statement#

Consider an $m \times n$ grid containing cells with three potential values:

$0$ , which indicates an unoccupied cell.
$1$ , representing a freshly picked orange.
$2$ , indicating a rotten orange.

Any fresh orange that is 4–directionally adjacent to a rotten orange will also turn rotten with each passing minute.

Your task is to determine the minimum time required for all cells to have rotten oranges. In case, this objective cannot be achieved, return $-1$ .

Constraints:

m $=$ grid.length
n $=$ grid[i].length
$1$ $\leq$ m, n $\leq$ $10$
grid[i][j] is 0, 1, or 2.

Examples#

Rotting Oranges

What is the output if the following $(3 \times 3)$ grid is given as input?

\begin{bmatrix} 1 & 1 & 1 \\ 1 & 2 & 1 \\ 1 & 1 & 1 \end{bmatrix}

Your Answer

Correct Answer

Explanation

Starting from the rotten orange at coordinate (1, 1), all of the adjacent cells will get rotten, this would take 1 minute, and then all the remaining corner cells will rot, this would take another minute. So, a total of 2 minutes are required to rot all the oranges.

Question 3 of 33 attempted

Asteroid Collision

Add Binary

Rotting Oranges

Statement#

Examples#

Understand the problem#

Try it yourself#